0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.14	% Command    : run_E %s %d THM
0.13/0.35	% Computer : n004.cluster.edu
0.13/0.35	% Model    : x86_64 x86_64
0.13/0.35	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.35	% Memory   : 8042.1875MB
0.13/0.35	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.35	% CPULimit   : 960
0.13/0.35	% WCLimit    : 120
0.13/0.35	% DateTime   : Tue Aug  9 03:17:50 EDT 2022
0.13/0.35	% CPUTime    : 
0.20/0.48	Running higher-order on 8 cores theorem proving
0.20/0.48	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p
0.20/0.49	# Version: 3.0pre003-ho
0.20/0.50	# Preprocessing class: HSMSSMSSMLMNHSN.
0.20/0.50	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.50	# Starting ho_unfolding_3 with 600s (5) cores
0.20/0.50	# Starting ehoh_best2_full_lfho with 120s (1) cores
0.20/0.50	# Starting almost_fo_3_lam with 120s (1) cores
0.20/0.50	# Starting post_as_ho1 with 120s (1) cores
0.20/0.50	# ehoh_best2_full_lfho with pid 31569 completed with status 0
0.20/0.50	# Result found by ehoh_best2_full_lfho
0.20/0.50	# Preprocessing class: HSMSSMSSMLMNHSN.
0.20/0.50	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.50	# Starting ho_unfolding_3 with 600s (5) cores
0.20/0.50	# Starting ehoh_best2_full_lfho with 120s (1) cores
0.20/0.50	# No SInE strategy applied
0.20/0.50	# Search class: HHHNS-FFSF11-SHSSMFNN
0.20/0.50	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.20/0.50	# Starting new_ho_10 with 65s (1) cores
0.20/0.50	# new_ho_10 with pid 31573 completed with status 0
0.20/0.50	# Result found by new_ho_10
0.20/0.50	# Preprocessing class: HSMSSMSSMLMNHSN.
0.20/0.50	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.50	# Starting ho_unfolding_3 with 600s (5) cores
0.20/0.50	# Starting ehoh_best2_full_lfho with 120s (1) cores
0.20/0.50	# No SInE strategy applied
0.20/0.50	# Search class: HHHNS-FFSF11-SHSSMFNN
0.20/0.50	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.20/0.50	# Starting new_ho_10 with 65s (1) cores
0.20/0.50	# Preprocessing time       : 0.001 s
0.20/0.50	# Presaturation interreduction done
0.20/0.50	
0.20/0.50	# Proof found!
0.20/0.50	# SZS status Theorem
0.20/0.50	# SZS output start CNFRefutation
0.20/0.50	thf(decl_22, type, qmltpeq: mu > mu > $i > $o).
0.20/0.50	thf(decl_23, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
0.20/0.50	thf(decl_24, type, mnot: ($i > $o) > $i > $o).
0.20/0.50	thf(decl_25, type, mor: ($i > $o) > ($i > $o) > $i > $o).
0.20/0.50	thf(decl_26, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
0.20/0.50	thf(decl_27, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
0.20/0.50	thf(decl_28, type, mtrue: $i > $o).
0.20/0.50	thf(decl_29, type, mfalse: $i > $o).
0.20/0.50	thf(decl_30, type, mand: ($i > $o) > ($i > $o) > $i > $o).
0.20/0.50	thf(decl_31, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
0.20/0.50	thf(decl_32, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
0.20/0.50	thf(decl_33, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
0.20/0.50	thf(decl_34, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
0.20/0.50	thf(decl_35, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
0.20/0.50	thf(decl_36, type, exists_in_world: mu > $i > $o).
0.20/0.50	thf(decl_37, type, mforall_ind: (mu > $i > $o) > $i > $o).
0.20/0.50	thf(decl_38, type, mexists_ind: (mu > $i > $o) > $i > $o).
0.20/0.50	thf(decl_39, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
0.20/0.50	thf(decl_40, type, mreflexive: ($i > $i > $o) > $o).
0.20/0.50	thf(decl_41, type, msymmetric: ($i > $i > $o) > $o).
0.20/0.50	thf(decl_42, type, mserial: ($i > $i > $o) > $o).
0.20/0.50	thf(decl_43, type, mtransitive: ($i > $i > $o) > $o).
0.20/0.50	thf(decl_44, type, meuclidean: ($i > $i > $o) > $o).
0.20/0.50	thf(decl_45, type, mpartially_functional: ($i > $i > $o) > $o).
0.20/0.50	thf(decl_46, type, mfunctional: ($i > $i > $o) > $o).
0.20/0.50	thf(decl_47, type, mweakly_dense: ($i > $i > $o) > $o).
0.20/0.50	thf(decl_48, type, mweakly_connected: ($i > $i > $o) > $o).
0.20/0.50	thf(decl_49, type, mweakly_directed: ($i > $i > $o) > $o).
0.20/0.50	thf(decl_50, type, mvalid: ($i > $o) > $o).
0.20/0.50	thf(decl_51, type, msatisfiable: ($i > $o) > $o).
0.20/0.50	thf(decl_52, type, mcountersatisfiable: ($i > $o) > $o).
0.20/0.50	thf(decl_53, type, minvalid: ($i > $o) > $o).
0.20/0.50	thf(decl_54, type, rel_s4: $i > $i > $o).
0.20/0.50	thf(decl_55, type, mbox_s4: ($i > $o) > $i > $o).
0.20/0.50	thf(decl_56, type, mdia_s4: ($i > $o) > $i > $o).
0.20/0.50	thf(decl_57, type, f: mu > $i > $o).
0.20/0.50	thf(decl_58, type, esk1_1: $i > mu).
0.20/0.50	thf(decl_59, type, esk2_0: $i).
0.20/0.50	thf(decl_60, type, esk3_0: $i).
0.20/0.50	thf(mimplies, axiom, ((mimplies)=(^[X4:$i > $o, X5:$i > $o]:(mor @ (mnot @ X4) @ X5))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mimplies)).
0.20/0.50	thf(mnot, axiom, ((mnot)=(^[X4:$i > $o, X3:$i]:(~((X4 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mnot)).
0.20/0.50	thf(mor, axiom, ((mor)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:(((X4 @ X3)|(X5 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mor)).
0.20/0.50	thf(mexists_ind, axiom, ((mexists_ind)=(^[X12:mu > $i > $o]:(mnot @ (mforall_ind @ (^[X13:mu]:(mnot @ (X12 @ X13))))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mexists_ind)).
0.20/0.50	thf(mforall_ind, axiom, ((mforall_ind)=(^[X10:mu > $i > $o, X3:$i]:(![X11:mu]:(((exists_in_world @ X11 @ X3)=>(X10 @ X11 @ X3)))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mforall_ind)).
0.20/0.50	thf(mdia_s4, axiom, ((mdia_s4)=(^[X4:$i > $o]:(mnot @ (mbox_s4 @ (mnot @ X4))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^5.ax', mdia_s4)).
0.20/0.50	thf(mbox_s4, axiom, ((mbox_s4)=(^[X4:$i > $o, X3:$i]:(![X7:$i]:((~((rel_s4 @ X3 @ X7))|(X4 @ X7)))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^5.ax', mbox_s4)).
0.20/0.50	thf(mvalid, axiom, ((mvalid)=(^[X4:$i > $o]:(![X3:$i]:((X4 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mvalid)).
0.20/0.50	thf(con, conjecture, (mvalid @ (mimplies @ (mdia_s4 @ (mforall_ind @ (^[X20:mu]:(f @ X20)))) @ (mexists_ind @ (^[X21:mu]:(mdia_s4 @ (f @ X21)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', con)).
0.20/0.50	thf(cumulative_ax, axiom, ![X19:mu, X7:$i, X3:$i]:(((exists_in_world @ X19 @ X3)<=((rel_s4 @ X7 @ X3)&(exists_in_world @ X19 @ X7)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^1.ax', cumulative_ax)).
0.20/0.50	thf(nonempty_ax, axiom, ![X7:$i]:(?[X18:mu]:((exists_in_world @ X18 @ X7))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', nonempty_ax)).
0.20/0.50	thf(c_0_11, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies])).
0.20/0.50	thf(c_0_12, plain, ((mnot)=(^[Z0:$i > $o, Z1:$i]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot])).
0.20/0.50	thf(c_0_13, plain, ((mor)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mor])).
0.20/0.50	thf(c_0_14, plain, ((mexists_ind)=(^[Z0:mu > $i > $o, Z1:$i]:(~((![X28:mu]:(((exists_in_world @ X28 @ Z1)=>(~((Z0 @ X28 @ Z1)))))))))), inference(fof_simplification,[status(thm)],[mexists_ind])).
0.20/0.50	thf(c_0_15, plain, ((mforall_ind)=(^[Z0:mu > $i > $o, Z1:$i]:(![X11:mu]:(((exists_in_world @ X11 @ Z1)=>(Z0 @ X11 @ Z1)))))), inference(fof_simplification,[status(thm)],[mforall_ind])).
0.20/0.50	thf(c_0_16, plain, ((mdia_s4)=(^[Z0:$i > $o, Z1:$i]:(~((![X30:$i]:((~((rel_s4 @ Z1 @ X30))|(~((Z0 @ X30)))))))))), inference(fof_simplification,[status(thm)],[mdia_s4])).
0.20/0.50	thf(c_0_17, plain, ((mbox_s4)=(^[Z0:$i > $o, Z1:$i]:(![X7:$i]:((~((rel_s4 @ Z1 @ X7))|(Z0 @ X7)))))), inference(fof_simplification,[status(thm)],[mbox_s4])).
0.20/0.50	thf(c_0_18, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_11, c_0_12]), c_0_13])).
0.20/0.50	thf(c_0_19, plain, ((mexists_ind)=(^[Z0:mu > $i > $o, Z1:$i]:(~((![X28:mu]:(((exists_in_world @ X28 @ Z1)=>(~((Z0 @ X28 @ Z1)))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14, c_0_12]), c_0_15])).
0.20/0.50	thf(c_0_20, plain, ((mvalid)=(^[Z0:$i > $o]:(![X3:$i]:((Z0 @ X3))))), inference(fof_simplification,[status(thm)],[mvalid])).
0.20/0.50	thf(c_0_21, plain, ((mdia_s4)=(^[Z0:$i > $o, Z1:$i]:(~((![X30:$i]:((~((rel_s4 @ Z1 @ X30))|(~((Z0 @ X30)))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_16, c_0_12]), c_0_17])).
0.20/0.50	thf(c_0_22, negated_conjecture, ~(![X39:$i]:((~(~(![X36:$i]:((~(rel_s4 @ X39 @ X36)|~(![X35:mu]:(((exists_in_world @ X35 @ X36)=>(f @ X35 @ X36))))))))|~(![X38:mu]:(((exists_in_world @ X38 @ X39)=>~(~(![X37:$i]:((~(rel_s4 @ X39 @ X37)|~(f @ X38 @ X37))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]), c_0_18]), c_0_15]), c_0_19]), c_0_20]), c_0_21])])).
0.20/0.50	thf(c_0_23, plain, ![X19:mu, X7:$i, X3:$i]:((((rel_s4 @ X7 @ X3)&(exists_in_world @ X19 @ X7))=>(exists_in_world @ X19 @ X3))), inference(fof_simplification,[status(thm)],[cumulative_ax])).
0.20/0.50	thf(c_0_24, negated_conjecture, ![X51:mu, X52:mu, X53:$i]:((((rel_s4 @ esk2_0 @ esk3_0)&(~(exists_in_world @ X51 @ esk3_0)|(f @ X51 @ esk3_0)))&(~(exists_in_world @ X52 @ esk2_0)|(~(rel_s4 @ esk2_0 @ X53)|~(f @ X52 @ X53))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])])).
0.20/0.50	thf(c_0_25, plain, ![X46:mu, X47:$i, X48:$i]:((~(rel_s4 @ X47 @ X48)|~(exists_in_world @ X46 @ X47)|(exists_in_world @ X46 @ X48))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])).
0.20/0.50	thf(c_0_26, negated_conjecture, ![X11:mu, X3:$i]:((~((exists_in_world @ X11 @ esk2_0))|~((rel_s4 @ esk2_0 @ X3))|~((f @ X11 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_24])).
0.20/0.50	thf(c_0_27, negated_conjecture, ![X11:mu]:(((f @ X11 @ esk3_0)|~((exists_in_world @ X11 @ esk3_0)))), inference(split_conjunct,[status(thm)],[c_0_24])).
0.20/0.50	thf(c_0_28, negated_conjecture, (rel_s4 @ esk2_0 @ esk3_0), inference(split_conjunct,[status(thm)],[c_0_24])).
0.20/0.50	thf(c_0_29, plain, ![X11:mu, X7:$i, X3:$i]:(((exists_in_world @ X11 @ X7)|~((rel_s4 @ X3 @ X7))|~((exists_in_world @ X11 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_25])).
0.20/0.50	thf(c_0_30, negated_conjecture, ![X11:mu]:((~((exists_in_world @ X11 @ esk2_0))|~((exists_in_world @ X11 @ esk3_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_28])])).
0.20/0.50	thf(c_0_31, plain, ![X40:$i]:((exists_in_world @ (esk1_1 @ X40) @ X40)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[nonempty_ax])])).
0.20/0.50	thf(c_0_32, negated_conjecture, ![X11:mu]:(~((exists_in_world @ X11 @ esk2_0))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_28]), c_0_30])).
0.20/0.50	thf(c_0_33, plain, ![X3:$i]:((exists_in_world @ (esk1_1 @ X3) @ X3)), inference(split_conjunct,[status(thm)],[c_0_31])).
0.20/0.50	thf(c_0_34, negated_conjecture, ($false), inference(spm,[status(thm)],[c_0_32, c_0_33]), ['proof']).
0.20/0.50	# SZS output end CNFRefutation
0.20/0.50	# Parsed axioms                        : 74
0.20/0.50	# Removed by relevancy pruning/SinE    : 0
0.20/0.50	# Initial clauses                      : 44
0.20/0.50	# Removed in clause preprocessing      : 37
0.20/0.50	# Initial clauses in saturation        : 7
0.20/0.50	# Processed clauses                    : 18
0.20/0.50	# ...of these trivial                  : 0
0.20/0.50	# ...subsumed                          : 0
0.20/0.50	# ...remaining for further processing  : 18
0.20/0.50	# Other redundant clauses eliminated   : 0
0.20/0.50	# Clauses deleted for lack of memory   : 0
0.20/0.50	# Backward-subsumed                    : 3
0.20/0.50	# Backward-rewritten                   : 0
0.20/0.50	# Generated clauses                    : 9
0.20/0.50	# ...of the previous two non-redundant : 6
0.20/0.50	# ...aggressively subsumed             : 0
0.20/0.50	# Contextual simplify-reflections      : 1
0.20/0.50	# Paramodulations                      : 9
0.20/0.50	# Factorizations                       : 0
0.20/0.50	# NegExts                              : 0
0.20/0.50	# Equation resolutions                 : 0
0.20/0.50	# Propositional unsat checks           : 0
0.20/0.50	#    Propositional check models        : 0
0.20/0.50	#    Propositional check unsatisfiable : 0
0.20/0.50	#    Propositional clauses             : 0
0.20/0.50	#    Propositional clauses after purity: 0
0.20/0.50	#    Propositional unsat core size     : 0
0.20/0.50	#    Propositional preprocessing time  : 0.000
0.20/0.50	#    Propositional encoding time       : 0.000
0.20/0.50	#    Propositional solver time         : 0.000
0.20/0.50	#    Success case prop preproc time    : 0.000
0.20/0.50	#    Success case prop encoding time   : 0.000
0.20/0.50	#    Success case prop solver time     : 0.000
0.20/0.50	# Current number of processed clauses  : 8
0.20/0.50	#    Positive orientable unit clauses  : 3
0.20/0.50	#    Positive unorientable unit clauses: 0
0.20/0.50	#    Negative unit clauses             : 1
0.20/0.50	#    Non-unit-clauses                  : 4
0.20/0.50	# Current number of unprocessed clauses: 2
0.20/0.50	# ...number of literals in the above   : 6
0.20/0.50	# Current number of archived formulas  : 0
0.20/0.50	# Current number of archived clauses   : 10
0.20/0.50	# Clause-clause subsumption calls (NU) : 3
0.20/0.50	# Rec. Clause-clause subsumption calls : 3
0.20/0.50	# Non-unit clause-clause subsumptions  : 1
0.20/0.50	# Unit Clause-clause subsumption calls : 4
0.20/0.50	# Rewrite failures with RHS unbound    : 0
0.20/0.50	# BW rewrite match attempts            : 2
0.20/0.50	# BW rewrite match successes           : 0
0.20/0.50	# Condensation attempts                : 18
0.20/0.50	# Condensation successes               : 0
0.20/0.50	# Termbank termtop insertions          : 2701
0.20/0.50	
0.20/0.50	# -------------------------------------------------
0.20/0.50	# User time                : 0.004 s
0.20/0.50	# System time              : 0.004 s
0.20/0.50	# Total time               : 0.008 s
0.20/0.50	# Maximum resident set size: 1920 pages
0.20/0.50	
0.20/0.50	# -------------------------------------------------
0.20/0.50	# User time                : 0.008 s
0.20/0.50	# System time              : 0.005 s
0.20/0.50	# Total time               : 0.012 s
0.20/0.50	# Maximum resident set size: 1804 pages
0.20/0.50	EOF